- procedure graph
- граф процедуры
граф процедуры
—
[http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
- procedure graph
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
procedure graph
Смотреть что такое "procedure graph" в других словарях:
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph partition — The graph partitioning problem in mathematics consists of dividing a graph into pieces, such that the pieces are of about the same size and there are few connections between the pieces.Consider a graph G(V,E), where V denotes the set of vertices… … Wikipedia
Grant procedure before the European Patent Office — Graph of European patent applications filed and granted between 1998 and 2007. Note that the average time from filing to grant in 2007 was 43.7 months (3.6 years) The grant procedure before the European Patent Office (EPO) is an ex parte,… … Wikipedia
Call graph — A call graph (also known as a call multigraph) is a directed graph that represents calling relationships between subroutines in a computer program. Specifically, each node represents a procedure and each edge (f,g) indicates that procedure f… … Wikipedia
Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Biased graph — In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are contained in a theta graph, then so is the third circle of the theta graph. A biased graph is a… … Wikipedia
Homeomorphism (graph theory) — In graph theory, two graphs G and G are homeomorphic if there is an isomorphism from some subdivision of G to some subdivision of G . If the edges of a graph are thought of as lines drawn from one vertex to another (as they are usually depicted… … Wikipedia
Constraint Composite Graph — The constraint composite graph is a node weighted undirected graph associated with a given combinatorial optimization problem posed as a weighted constraint satisfaction problem. Developed and introduced by Satish Kumar Thittamaranahalli (T. K.… … Wikipedia
Beaver Bit-vector Decision Procedure — Beaver is a Satisfiability Modulo Theories (SMT) decision procedure for the theory of quantifier free finite precision bit vector arithmetic ( [http://combination.cs.uiowa.edu/smtlib/logics/QF BV.smt QF BV] ). Its prototype implementation… … Wikipedia
граф процедуры — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN procedure graph … Справочник технического переводчика
